<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>UCARPP: includes/edgeID.h File Reference</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
</script>


</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">UCARPP
   &#160;<span id="projectnumber">1</span>
   </div>
   
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.7.6.1 -->
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="annotated.html"><span>Data&#160;Structures</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>Globals</span></a></li>
    </ul>
  </div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
  initNavTree('edgeID_8h.html','');
</script>
<div id="doc-content">
<div class="header">
  <div class="summary">
<a href="#nested-classes">Data Structures</a> &#124;
<a href="#define-members">Defines</a> &#124;
<a href="#typedef-members">Typedefs</a> &#124;
<a href="#func-members">Functions</a>  </div>
  <div class="headertitle">
<div class="title">includes/edgeID.h File Reference</div>  </div>
</div><!--header-->
<div class="contents">
<div class="textblock"><code>#include &lt;stdlib.h&gt;</code><br/>
<code>#include &lt;stdio.h&gt;</code><br/>
<code>#include &lt;stdbool.h&gt;</code><br/>
</div><div class="textblock"><div class="dynheader">
Include dependency graph for edgeID.h:</div>
<div class="dyncontent">
<div class="center"><img src="edgeID_8h__incl.png" border="0" usemap="#includes_2edgeID_8h" alt=""/></div>
</div>
</div><div class="textblock"><div class="dynheader">
This graph shows which files directly or indirectly include this file:</div>
<div class="dyncontent">
<div class="center"><img src="edgeID_8h__dep__incl.png" border="0" usemap="#includes_2edgeID_8hdep" alt=""/></div>
<map name="includes_2edgeID_8hdep" id="includes_2edgeID_8hdep">
<area shape="rect" id="node3" href="edgeSol_8h.html" title="includes/edgeSol.h" alt="" coords="556,83,686,112"/><area shape="rect" id="node31" href="operations_8h.html" title="includes/operations.h" alt="" coords="169,315,313,344"/><area shape="rect" id="node38" href="tabooExpire_8h.html" title="includes/tabooExpire.h" alt="" coords="684,160,838,189"/><area shape="rect" id="node57" href="gMatrix_8h.html" title="includes/gMatrix.h" alt="" coords="17,237,145,267"/><area shape="rect" id="node63" href="graph_8h.html" title="includes/graph.h" alt="" coords="1281,392,1398,421"/><area shape="rect" id="node74" href="edgeIDEvaluator_8h.html" title="includes/edgeIDEvaluator.h" alt="" coords="1022,83,1204,112"/><area shape="rect" id="node76" href="fMatrix_8h.html" title="includes/fMatrix.h" alt="" coords="985,160,1110,189"/><area shape="rect" id="node5" href="vehiclePath_8h.html" title="includes/vehiclePath.h" alt="" coords="389,160,541,189"/><area shape="rect" id="node7" href="vehicleState_8h.html" title="includes/vehicleState.h" alt="" coords="312,237,469,267"/><area shape="rect" id="node9" href="add_8h.html" title="includes/add.h" alt="" coords="116,547,222,576"/><area shape="rect" id="node11" href="solution_8h.html" title="includes/solution.h" alt="" coords="338,392,469,421"/><area shape="rect" id="node22" href="remove_8h.html" title="includes/remove.h" alt="" coords="246,547,374,576"/><area shape="rect" id="node24" href="swap_8h.html" title="includes/swap.h" alt="" coords="674,547,789,576"/><area shape="rect" id="node13" href="los_8h.html" title="includes/los.h" alt="" coords="820,469,921,499"/><area shape="rect" id="node16" href="stm_8h.html" title="includes/stm.h" alt="" coords="1016,547,1122,576"/><area shape="rect" id="node20" href="ltm_8h.html" title="rappresenta il livello LTM dell&#39;algoritmo UCARPP" alt="" coords="973,701,1074,731"/><area shape="rect" id="node26" href="graphbmp-tools_8h.html" title="includes/graphbmp&#45;tools.h" alt="" coords="318,469,492,499"/><area shape="rect" id="node18" href="LTMConfiguration_8h.html" title="includes/LTMConfiguration.h" alt="" coords="996,624,1182,653"/><area shape="rect" id="node40" href="tabooList_8h.html" title="includes/tabooList.h" alt="" coords="658,237,797,267"/><area shape="rect" id="node51" href="ALGConfiguration_8h.html" title="includes/ALGConfiguration.h" alt="" coords="1021,392,1208,421"/><area shape="rect" id="node44" href="tabooState_8h.html" title="includes/tabooState.h" alt="" coords="840,392,986,421"/><area shape="rect" id="node54" href="configparser_8h.html" title="includes/configparser.h" alt="" coords="1046,469,1201,499"/><area shape="rect" id="node68" href="main-tools_8h.html" title="includes/main&#45;tools.h" alt="" coords="1572,469,1716,499"/><area shape="rect" id="node70" href="parser_8h.html" title="includes/parser.h" alt="" coords="1377,469,1497,499"/><area shape="rect" id="node78" href="LTMFrequencies_8h.html" title="contiene le tabelle delle frequenze di ogni camion" alt="" coords="1317,315,1498,344"/></map>
</div>
</div>
<p><a href="edgeID_8h_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr><td colspan="2"><h2><a name="nested-classes"></a>
Data Structures</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structEdgeID.html">EdgeID</a></td></tr>
<tr><td colspan="2"><h2><a name="define-members"></a>
Defines</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="edgeID_8h.html#a127c90056f6819ba5ae6eabe945e1c3d">NO_SHARED_NODE</a>&#160;&#160;&#160;-1</td></tr>
<tr><td colspan="2"><h2><a name="typedef-members"></a>
Typedefs</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef struct <a class="el" href="structEdgeID.html">EdgeID</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="edgeID_8h.html#a932712b65cb2dbbd54c994a0056c9421">EdgeID</a></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef <a class="el" href="structEdgeID.html">EdgeID</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a></td></tr>
<tr><td colspan="2"><h2><a name="func-members"></a>
Functions</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="edgeID_8h.html#ab2cbd7993ccb4900ac0352cdbda1163c">freeEdgeID</a> (<a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a> edge)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="edgeID_8h.html#a77a0dff934516487753632893ec5a3ca">initEdgeID</a> (short _start, short _end)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="edgeID_8h.html#aa52da7df1632191ef8e2f372b9b6b385">printEdgeID</a> (FILE *f, <a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a> e)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="edgeID_8h.html#aa815c0263b2a9681750a5fda8c426727">equals</a> (<a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a> e1, <a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a> e2)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="edgeID_8h.html#ac589c412a08baf058ff248347915077c">areConsecutive</a> (<a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a> e1, <a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a> e2)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="edgeID_8h.html#a2afada670c995b4150599c1bd59dcf73">getSharedNode</a> (<a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a> e1, <a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a> e2)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="edgeID_8h.html#aba9b333504cf90d6d4211e6434500d00">isNodeUsedByEdgeID</a> (<a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a> e, int node)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="edgeID_8h.html#a12a0e9b35c558cf175470e2100644338">validateEdgeID</a> (<a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a> e)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="edgeID_8h.html#a2d31b8fe1f149d8403eeecaf50be4354">getEdgeIDOtherNode</a> (<a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a> e, int node)</td></tr>
</table>
<hr/><h2>Define Documentation</h2>
<a class="anchor" id="a127c90056f6819ba5ae6eabe945e1c3d"></a><!-- doxytag: member="edgeID.h::NO_SHARED_NODE" ref="a127c90056f6819ba5ae6eabe945e1c3d" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define <a class="el" href="edgeID_8h.html#a127c90056f6819ba5ae6eabe945e1c3d">NO_SHARED_NODE</a>&#160;&#160;&#160;-1</td>
        </tr>
      </table>
</div>
<div class="memdoc">

</div>
</div>
<hr/><h2>Typedef Documentation</h2>
<a class="anchor" id="a932712b65cb2dbbd54c994a0056c9421"></a><!-- doxytag: member="edgeID.h::EdgeID" ref="a932712b65cb2dbbd54c994a0056c9421" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef struct <a class="el" href="structEdgeID.html">EdgeID</a>  <a class="el" href="structEdgeID.html">EdgeID</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<p>Un arco non orientato. </p>

</div>
</div>
<a class="anchor" id="a73a3d93dc3a3c49a3e5ec5ec758e309f"></a><!-- doxytag: member="edgeID.h::PedgeID" ref="a73a3d93dc3a3c49a3e5ec5ec758e309f" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef <a class="el" href="structEdgeID.html">EdgeID</a>* <a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<p>Puntatore di servizio. </p>

</div>
</div>
<hr/><h2>Function Documentation</h2>
<a class="anchor" id="ac589c412a08baf058ff248347915077c"></a><!-- doxytag: member="edgeID.h::areConsecutive" ref="ac589c412a08baf058ff248347915077c" args="(PedgeID e1, PedgeID e2)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">bool <a class="el" href="edgeID_8h.html#ac589c412a08baf058ff248347915077c">areConsecutive</a> </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a>&#160;</td>
          <td class="paramname"><em>e1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a>&#160;</td>
          <td class="paramname"><em>e2</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<p>verifica che i due archi inseriti siano o meno consecutivi. Due archi sono definiti consecutivi se e solo se: </p>
<p class="formulaDsp">
<img class="formulaDsp" alt="\[ e1_{ab}, e2_{cd} : a=c \vee b=c \vee a=D \vee b=d \]" src="form_6.png"/>
</p>
<p> non e' necessario che i due archi abbiamo i&lt;j (anche se cio' velocizza la funzione)</p>
<dl class="pre"><dt><b>Precondition:</b></dt><dd><ul>
<li>e1 non NULL </li>
<li>e2 non NULL</li>
</ul>
</dd></dl>
<dl class="params"><dt><b>Parameters:</b></dt><dd>
  <table class="params">
    <tr><td class="paramname">e1</td><td>il primo arco da valutare </td></tr>
    <tr><td class="paramname">e2</td><td>il secondo arco da valutare </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>Returns:</b></dt><dd>TRUE se i due archi sono consecutivi, FALSE altrimenti </dd></dl>

</div>
</div>
<a class="anchor" id="aa815c0263b2a9681750a5fda8c426727"></a><!-- doxytag: member="edgeID.h::equals" ref="aa815c0263b2a9681750a5fda8c426727" args="(PedgeID e1, PedgeID e2)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">bool <a class="el" href="edgeID_8h.html#aa815c0263b2a9681750a5fda8c426727">equals</a> </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a>&#160;</td>
          <td class="paramname"><em>e1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a>&#160;</td>
          <td class="paramname"><em>e2</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<p>per definizione un arco a coincide con un arco b se i nodi coinvolti sono gli stessi. Per esempio queste coppie di archi sono tutte identiche: </p>
<ul>
<li>1--2 1--2 </li>
<li>1--2 2--1</li>
</ul>
<dl class="params"><dt><b>Parameters:</b></dt><dd>
  <table class="params">
    <tr><td class="paramname">arc1</td><td>il primo arco da comparare </td></tr>
    <tr><td class="paramname">arc2</td><td>il secondo arco da comparare </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>Returns:</b></dt><dd>"true" se il campi i e j dei due archi coincidono; "false" altrimenti </dd></dl>

</div>
</div>
<a class="anchor" id="ab2cbd7993ccb4900ac0352cdbda1163c"></a><!-- doxytag: member="edgeID.h::freeEdgeID" ref="ab2cbd7993ccb4900ac0352cdbda1163c" args="(PedgeID edge)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="edgeID_8h.html#ab2cbd7993ccb4900ac0352cdbda1163c">freeEdgeID</a> </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a>&#160;</td>
          <td class="paramname"><em>edge</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<p>libera la memoria occupata da questa tabu deallocando lo spazio occupato dalla struttura puntata.</p>
<dl class="params"><dt><b>Parameters:</b></dt><dd>
  <table class="params">
    <tr><td class="paramname">edge</td><td>l'elemento <a class="el" href="structEdgeID.html">EdgeID</a> da eliminare </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a class="anchor" id="a2d31b8fe1f149d8403eeecaf50be4354"></a><!-- doxytag: member="edgeID.h::getEdgeIDOtherNode" ref="a2d31b8fe1f149d8403eeecaf50be4354" args="(PedgeID e, int node)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int <a class="el" href="edgeID_8h.html#a2d31b8fe1f149d8403eeecaf50be4354">getEdgeIDOtherNode</a> </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a>&#160;</td>
          <td class="paramname"><em>e</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">int&#160;</td>
          <td class="paramname"><em>node</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<p>determina l'altro nodo coinvolto da questo arco</p>
<dl class="pre"><dt><b>Precondition:</b></dt><dd><ul>
<li>e non NULL </li>
<li>node e' uno dei due estremi di e</li>
</ul>
</dd></dl>
<dl class="params"><dt><b>Parameters:</b></dt><dd>
  <table class="params">
    <tr><td class="paramname">e</td><td>l'arco da valutare </td></tr>
    <tr><td class="paramname">node</td><td>uno dei due nodi collegati da e </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>Returns:</b></dt><dd>l'altro nodo collegato da e </dd></dl>

</div>
</div>
<a class="anchor" id="a2afada670c995b4150599c1bd59dcf73"></a><!-- doxytag: member="edgeID.h::getSharedNode" ref="a2afada670c995b4150599c1bd59dcf73" args="(PedgeID e1, PedgeID e2)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int <a class="el" href="edgeID_8h.html#a2afada670c995b4150599c1bd59dcf73">getSharedNode</a> </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a>&#160;</td>
          <td class="paramname"><em>e1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a>&#160;</td>
          <td class="paramname"><em>e2</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<p>calcola il nodo comune a 2 edge consecuitutivi</p>
<dl class="pre"><dt><b>Precondition:</b></dt><dd><ul>
<li>e1 non NULL </li>
<li>e2 non NULL </li>
<li>e1 consecutivo a e2 (usare la funzione areConsecutive )</li>
</ul>
</dd></dl>
<dl class="params"><dt><b>Parameters:</b></dt><dd>
  <table class="params">
    <tr><td class="paramname">e1</td><td>un edge </td></tr>
    <tr><td class="paramname">e2</td><td>un edge </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>Returns:</b></dt><dd>il nodo comune agli edge e1 ed e2 </dd>
<dd>
NO_SHARED_NODE sse non esiste un nodo comune. </dd></dl>

</div>
</div>
<a class="anchor" id="a77a0dff934516487753632893ec5a3ca"></a><!-- doxytag: member="edgeID.h::initEdgeID" ref="a77a0dff934516487753632893ec5a3ca" args="(short _start, short _end)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a> <a class="el" href="edgeID_8h.html#a77a0dff934516487753632893ec5a3ca">initEdgeID</a> </td>
          <td>(</td>
          <td class="paramtype">short&#160;</td>
          <td class="paramname"><em>_start</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">short&#160;</td>
          <td class="paramname"><em>_end</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<p>costurisce un nuovo elemento <a class="el" href="structEdgeID.html">EdgeID</a>.</p>
<dl class="post"><dt><b>Postcondition:</b></dt><dd><ul>
<li>viene allocata in memoria un novo <a class="el" href="structEdgeID.html">EdgeID</a> <b>senza</b> controllare se i&lt;j</li>
</ul>
</dd></dl>
<dl class="params"><dt><b>Parameters:</b></dt><dd>
  <table class="params">
    <tr><td class="paramname">_start</td><td>indica il vertice di inizio dell'arco </td></tr>
    <tr><td class="paramname">_end</td><td>indica il vertice di fine dell'arco </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a class="anchor" id="aba9b333504cf90d6d4211e6434500d00"></a><!-- doxytag: member="edgeID.h::isNodeUsedByEdgeID" ref="aba9b333504cf90d6d4211e6434500d00" args="(PedgeID e, int node)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">bool <a class="el" href="edgeID_8h.html#aba9b333504cf90d6d4211e6434500d00">isNodeUsedByEdgeID</a> </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a>&#160;</td>
          <td class="paramname"><em>e</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">int&#160;</td>
          <td class="paramname"><em>node</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<p>verifica se il particolare nodo e' una estremita' dell'arco passato.</p>
<dl class="pre"><dt><b>Precondition:</b></dt><dd><ul>
<li>e non NULL</li>
</ul>
</dd></dl>
<dl class="params"><dt><b>Parameters:</b></dt><dd>
  <table class="params">
    <tr><td class="paramname">e</td><td>l'arco da verificare </td></tr>
    <tr><td class="paramname">node</td><td>il nodo da verificare </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>Returns:</b></dt><dd>TRUE se il nodo e' una estremita' dell'arco, FALSE altrimenti </dd></dl>

</div>
</div>
<a class="anchor" id="aa52da7df1632191ef8e2f372b9b6b385"></a><!-- doxytag: member="edgeID.h::printEdgeID" ref="aa52da7df1632191ef8e2f372b9b6b385" args="(FILE *f, PedgeID e)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="edgeID_8h.html#aa52da7df1632191ef8e2f372b9b6b385">printEdgeID</a> </td>
          <td>(</td>
          <td class="paramtype">FILE *&#160;</td>
          <td class="paramname"><em>f</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a>&#160;</td>
          <td class="paramname"><em>e</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<p>funzione adatta in fase di testing. Stampa sul file passato come parametro una rappresentazione di un elemento Arc. l'espressione stampata e': </p>
<center>(START-&gt;END)</center><dl class="params"><dt><b>Parameters:</b></dt><dd>
  <table class="params">
    <tr><td class="paramname">f</td><td>indica il file su cui scrivere; </td></tr>
    <tr><td class="paramname">edge</td><td>indica l'arco da stampare; </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a class="anchor" id="a12a0e9b35c558cf175470e2100644338"></a><!-- doxytag: member="edgeID.h::validateEdgeID" ref="a12a0e9b35c558cf175470e2100644338" args="(PedgeID e)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="edgeID_8h.html#a12a0e9b35c558cf175470e2100644338">validateEdgeID</a> </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="edgeID_8h.html#a73a3d93dc3a3c49a3e5ec5ec758e309f">PedgeID</a>&#160;</td>
          <td class="paramname"><em>e</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<p>riassetta l'arco in modo che si verifichi i&lt;j</p>
<dl class="pre"><dt><b>Precondition:</b></dt><dd><ul>
<li>e non NULL</li>
</ul>
</dd></dl>
<dl class="post"><dt><b>Postcondition:</b></dt><dd><ul>
<li>e non NULL </li>
<li>e ha i&lt;j</li>
</ul>
</dd></dl>
<dl class="params"><dt><b>Parameters:</b></dt><dd>
  <table class="params">
    <tr><td class="paramname">e</td><td>l'arco da confermare </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
</div><!-- contents -->
</div>
  <div id="nav-path" class="navpath">
    <ul>
      <li class="navelem"><a class="el" href="edgeID_8h.html">edgeID.h</a>      </li>

    <li class="footer">Generated on Wed Sep 4 2013 06:38:56 for UCARPP by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.6.1 </li>
   </ul>
 </div>


</body>
</html>
